Three Generalizations of Davenport--Schinzel Sequences

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three Generalizations of Davenport-Schinzel Sequences

We present new, and mostly sharp, bounds on the maximum length of certain generalizations of Davenport-Schinzel sequences. Among the results are sharp bounds on order-s double DS sequences, for all s, sharp bounds on sequences avoiding catenated permutations (aka formation free sequences), and new lower bounds on sequences avoiding zig-zagging patterns.

متن کامل

8. Davenport-schinzel Sequences

Definition 18.1 A (n, s)-Davenport-Schinzel sequence is a sequence over an alphabet A of size n in which no two consecutive characters are the same and there is no alternating subsequence of the form .

متن کامل

Generalized Davenport-Schinzel Sequences

The extremal function Ex(u, n) (introduced in the theory of DavenportSchinzel sequences in other notation) denotes for a fixed finite alternating sequence u = ababa . . . the maximum length of a finite sequence v over n symbols with no immediate repetition which does not contain u. Here (following the idea of J. Nešetřil) we generalize this concept for arbitrary sequence u. We summarize the alr...

متن کامل

On numbers of Davenport-Schinzel sequences

One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bijective encoding of such sequences by rooted plane trees with distinguished nonleaves and we give a combinatorial proof of the formula 1 k − n+ 1 ( 2k − 2n k − n )( k − 1 2n− k − 1 ) for the number of such normalized seq...

متن کامل

Sources of Superlinearity in Davenport-Schinzel Sequences

A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problems in this area is bounding (asymptotically) the maximum length of such sequences. Following Klazar, let Ex(σ, n) be the maximum length of a sequence over an alphabet of size n avoiding subsequences isomorphic to σ. It ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2015

ISSN: 0895-4801,1095-7146

DOI: 10.1137/140968574